Time-dependent solution of the foreground-background processor-sharing queue
نویسندگان
چکیده
منابع مشابه
The Foreground-Background Processor-Sharing Queue: a survey
We give an overview of the results in the literature on single-server queues with the Foreground-Background (FB) discipline. The FB discipline gives service to the customer that has received the least amount of service. This not so well-known discipline has some appealing features, and performs very well for heavy-tailed service times. We describe results on the stationary queue length, the max...
متن کاملThe Foregound-Background Processor Sharing Queue: an overview
We give an overview of the results in the literature on single-server queues with the FB discipline. The FB discipline gives service to the customer that has received the least amount of service. This not so well-known discipline has some appealing features, and performs well for heavy-tailed service times. We describe results on the queue length, sojourn time, and the influence of variability ...
متن کاملThe Foreground-Background queue: A survey
Computer systems researchers have begun to apply the Foreground-Background (FB) scheduling discipline to a variety of applications, and as a result, there has been a resurgence in theoretical research studying FB. In this paper, we bring together results from both of these research streams to provide a survey of state-of-the-art theoretical results characterizing the performance of FB. Our emph...
متن کاملSojourn time asymptotics in the MG1 processor sharing queue
We show for the M/G/1 processor sharing queue that the service time distribution is regularly varying of index −ν, ν non-integer, iff the sojourn time distribution is regularly varying of index −ν. This result is derived from a new expression for the Laplace–Stieltjes transform of the sojourn time distribution. That expression also leads to other new properties for the sojourn time distribution...
متن کاملMonotonicity in the limited processor sharing queue
We study a processor sharing queue with a limited number of service positions and an infinite buffer. The occupied service positions share an underlying resource. We prove that for service times with a decreasing failure rate, the queue length is stochastically decreasing in the number of service positions, and that for service times with an increasing failure rate, the queue length is stochast...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics and Stochastic Analysis
سال: 1993
ISSN: 1048-9533,1687-2177
DOI: 10.1155/s1048953393000334